منابع مشابه
Roots of unity in orders
We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in the group of roots of unity can be solved in polynomial time. As an auxiliary result, we solve the discrete logarithm problem for certain unit groups in finite...
متن کاملNews about Roots of Unity
This text was originally intended for non-mathematicians; during its preparation B. Mazur and A. Wiles announced the solution of the ’Main Conjecture’ in the theory of cyclotomic fields. It seemed appropriate to us to try to give an explanation of what this sensational discovery is all about.
متن کاملStable Computation of the Complex Roots of Unity Stable Computation of the Complex Roots of Unity
In this paper, we show that the problem of computing the complex roots of unity is not as simple as it seems at rst. In particular, the formulas given in a standard programmer's reference book Knuth, Seminumerical Algorithms, 1981] are shown to be numerically unstable, giving unacceptably large error for moderate sized sequences. We give alternative formulas, which we show to be superior both b...
متن کاملSolving algebraic equations in roots of unity
This paper is devoted to finding solutions of polynomial equations in roots of unity. It was conjectured by S. Lang and proved by M. Laurent that all such solutions can be described in terms of a finite number of parametric families called maximal torsion cosets. We obtain new explicit upper bounds for the number of maximal torsion cosets on an algebraic subvariety of the complex algebraic n-to...
متن کاملComputing Roots of Unity in Fields
The paper is in four sections. First we provide some necessary background to computing in fields; then follows a collection of algebraic lemmas. In Section 3 we prove the theorem and in Section 4 append useful information on related decision problems. These theorems are straightforward contributions to Computable Algebra, to work on fields and (non finitely presented) groups (see Sections 1 and...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Foundations of Computational Mathematics
سال: 2016
ISSN: 1615-3375,1615-3383
DOI: 10.1007/s10208-016-9304-1